We consider the situation in which an organizer is trying to convene an event, and needs to decide on a schedule: a time slot and a set of invitees from a given set of agents. For each possible time slot, each agent has a single-peaked preference over the number of attendees at the event. Agent also has the outside option of not attending, which she prefers in some situations. The task of the o...

Traditional group scheduling applications often treat users' availability as binary: free or busy. This is an unrealistic representation because not all times are equally free or busy. The inflexibility makes it difficult to find times with which everyone is truly satisfied. We present an online group scheduling approach by which users indicate four-tier preferences for meeting times on a calen...

<p style='text-indent:20px;'>In this research, a parallel machine sequence-dependent group scheduling problem with the goal of minimizing total weighted earliness and tardiness is investigated. First, mathematical model developed for research which can be used solving small-sized instances. Since shown to NP-hard, focuses on proposing meta-heuristic algorithms finding near-optimal solutio...

different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. conventional productionmethods are constantly subs...